import org.korifey.ffalg.NumberTheory;


public class Problem9 {
	public static void main(String[] args) {
		System.out.println(solve());
	}

	public static long solve() {
		for (int a=1; a<=1000/3; a++) {
			for (int b=a+1; 2*b+a<1000; b++) {
				int c = 1000 - a - b;				
				if (a*a + b*b == c*c) {
					System.out.println(a+" "+b+" "+c);
					return a*b*c;
				}
				
			}
		}
		return 0;
	}
}
